ITERATION AND RECURSION

Syntactic recursion and iteration

The nature and origin of syntactic recursion in natural languages is a topical problem. Important recent contributions include those of Johansson (2005), Parker (2006), Tomalin (2006; 2007), and Heine and Kuteva (2007). Syntactic recursion will here be discussed especially in relation to its cognate concept of iteration. Their basic common feature is plain structural repetition: “keep on emitti...

Recursion from Iteration

In a simply-typed, call-by-value (CBV) language with rst-class continuations , the usual CBV xpoint operator can be deened in terms of a simple, innnitely-looping iteration primitive. We rst consider a natural but awed deenition, based on exceptions and \iterative deepening" of nite unfoldings, and point out some of its shortcomings. Then we present the proper construction using full rst-class ...

Recursion, Iteration and Hume Scheduling

Converting programs from full or PR-Hume to FSMor HW-Hume involves transforming expression recursion to box iteration. However, this can add considerable overheads through unnecessary scheduling of other boxes dependent on the iteration output. Here we explore how analysis of output behaviour can identify boxes which may be executed independently of normal super-step scheduling, without affecti...

Reducing Recursion to Iteration by Algebraic Extension

Recursion and Iteration Support in USE Validator with AnATLyzer

Model finders enable numerous verification approaches based on searching the existence of models satisfying certain properties of interest. One of such approaches is anATLyzer, a static analysis tool for ATL transformations, which relies on USE Validator to provide fine grained analysis based on finding witness models that satisfy the OCL path conditions associated to particular errors. However...